A Test of Linearity Using Covering Arrays for Evaluating Uncertainty in Measurement
نویسندگان
چکیده
Since the Guide to the Expression of Uncertainty in Measurement (GUM) was published in 1993 it has changed the evaluation of physical and chemical measurements. Nowadays almost all high level measurements include a detailed evaluation of uncertainty. This allows the scientific community to do the next step and evaluate uncertainty for derived evaluations like parameter fittings. The evaluation of the uncertainty for complicated parameters like the results from non-linear fitting procedures can be carried out in two steps. The first step is a sensitivity analysis of the evaluation algorithm and a test of mutual independence of the parameters. If the fitting algorithm is sufficiently robust a linear model is derived from the fitting algorithm which is then used in a second step to evaluate the uncertainty of the fitting parameters. This paper discusses the sensitivity analysis in detail with the emphasis on possibilities to check for robustness and linearity. An efficient method based on covering arrays is presented to test for hidden couplings between the input parameters inside the evaluation model.
منابع مشابه
Using the Particle Swarm Optimization Algorithm to Generate the Minimum Test Suite in Covering Array with Uniform Strength
Up to now, several useful algorithms have been proposed to generate covering array, which is one of the branches of combinatorial testing. The main challenge in generating such arrays is generation of the arrays with a minimum number of test cases (for efficiency) at a proper time (for performance), for large systems. Covering array generation strategies are often divided into two general categ...
متن کاملProfiles of covering arrays of strength two
Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation techniques c...
متن کاملPresenting a three-objective model in location-allocation problems using combinational interval full-ranking and maximal covering with backup model
Covering models have found many applications in a wide variety of real-world problems; nevertheless, some assumptions of covering models are not realistic enough. Accordingly, a general approach would not be able to answer the needs of encountering varied aspects of real-world considerations. Assumptions like the unavailability of servers, uncertainty, and evaluating more factors at the same ti...
متن کاملNISTIR 7878 Combinatorial Coverage Measurement
Combinatorial testing applies factor covering arrays [6, 7] to test all t-way combinations of input or configuration state space. In some testing situations, it is not practical to use covering arrays, but any set of tests with n parameters covers at least some proportion of t-way combinations up to t ≤ n. This report describes measures of combinatorial coverage that can be used in evaluating t...
متن کاملNISTIR 7878 Combinatorial Coverage Measurement D . Richard
Combinatorial testing applies factor covering arrays [6, 7] to test all t-way combinations of input or configuration state space. In some testing situations, it is not practical to use covering arrays, but any set of tests with n parameters covers at least some proportion of t-way combinations up to t ≤ n. This report describes measures of combinatorial coverage that can be used in evaluating t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008